A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
نویسندگان
چکیده
A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decoder is less than the conventional step-by-step decoding algorithm, since it reduces at least half of the matrix computations and the most complex element in the conventional step-by-step decoder is the “matrix-computing” element. key words: BCH code, step-by-step decoding, matrix computation, computational complexity
منابع مشابه
A Simple Step-by-Step Decoding of Binary BCH Codes
In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-ChaudhuriHocquenghem (BCH) codes based on logical analysis. Compared to the conventional stepby-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication. key words: BCH code,...
متن کاملOn Step-by-Step Complete Decoding Triple-Error-Correcting Binary BCH Codes
The decoding beyond the Bose-Chaudhuri-Hocquenghem (BCH) bound is always an interesting research topic in block error correction codes. However, searching a complete decoding algorithm is not easy since all the error patterns that belong to the coset leaders of the standard array need to be correctable [1]. Both the well-known standard algebraic method and the step-by-step method can be used to...
متن کاملA Modified Step-By-Step Decoding for Binary BCH Codes
This study presents a modified and conceptually simple step-by-step decoding algorithm for binary cyclic BCH codes. Step-by-step decoding temporarily changes one information bit value at a time and then checks weather the weight of the error pattern decreases by computing the corresponding syndrome matrix determinant. Based on the channel information, this study propose a modified step-by-step ...
متن کاملExtension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
Absrrucr -The BCH algorithm can be extended to correct more errors than indicated by the BCH bound. In the first step of the decoding procedure, we correct a number of errors, corresponding to a particular case of the Hartmann-Tzeng bound. In the second step we aim at full error correction. A measure for the worst-case number of field elements of an extension field GF(2") that must be tested fo...
متن کاملA high-speed real-time binary BCH decoder
A high-speed real-time decoder for t-errorcorrecting binary Bose-Chaudhuri-Hocquenghem (BCH) codes based on a modified step-by-step decoding algorithm is presented. The average operation cycles for decoding each received word is just equal to the block length of the codeword. The decoder is constructed by three modules: the syndrome module, the comparison module, and the error corrector. Since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005